منابع مشابه
Harmonic Coordinates on Finitely Connected Fractafolds
We define finitely connected fractafolds, which are generalizations of p.c.f. self-similar sets introduced by Kigami and of fractafolds introduced by Strichartz. Any self-similarity is not assumed, and countably infinite ramification is allowed. We prove that if a fractafold has a resistance form in the sense of Kigami that satisfies certain assumptions, then there exists a weak Riemannian metr...
متن کاملConformal Welding for Finitely Connected Regions
We discuss a numerical implementation of conformal welding for finitely connected regions using the geodesic zipper algorithm and Koebe’s iterative method for computing conformal maps to regions bounded by circles. We also show that a conformal map from a finitely connected region to a region bounded by circles can be written as a composition of finitely many conformal maps of simply connected ...
متن کاملFinitely generated connected locally compact groups
Hofmann and Morris [6] proved that a locally compact connected group G has a finite subset generating a dense subgroup if and only if the weight w(G) of G does not exceed c , the cardinality of the continuum. The minimum cardinality of such a topological generating set is an invariant of the group, is denoted by σ(G), and is called the topological rank of G . For compact abelian groups of weigh...
متن کاملA note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on connected dominating set problem which is a special case of the minimum connected set cover problem.
متن کاملThe set of types of a finitely generated variety
Berman, J.D., E.W. Kiss, P. Priihle and A. Szendrei, The set of types of a finitely generated variety, Discrete Mathematics 112 (1993) l-20. The paper presents an algorithm of polynomial time complexity to compute the type set of a finite algebraic system A, as defined in the monograph of McKenzie and Hobby: ‘The Structure of Finite Algebras’. To do so, it introduces the concept of a subtrace, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1940
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1940-07167-8